/**
 * Problem Statement
    
A string S is called a square if there is some string T such that S = T + T. 
For example, the strings "", "aabaab" and "xxxx" are squares, but "a", "aabb" and "aabbaa" are not.  
You are given a String s. 
Find the longest square string that can be obtained from s by erasing some (possibly none, possibly all) 
of its characters. In other words, we are looking for the longest square that occurs in s as a subsequence. 

Return the length of that square.  
Note that the answer is well-defined, as the square "" (the empty string) will always occur in s as a subsequence.

 * point:
 *   
 * 
 */
package org.yuwgle.srm.r698.d2;

public class RepeatStringEasy {

	public int maximalLength(String s) {
		
		
		return 0;
	}
}
